Resource Logics, Grammars, and Processing
نویسنده
چکیده
The paper discusses work in progress on developing a tabular deduction method for multimodal logical grammar. The method is based on a compilation procedure, a single elimination rule for multiplicative and additive (t) binary operators, and two rules defining residuation for the unary modals i/ #i . The method aims to achieve for multimodal logical grammar what chart-based parsing does for CFGs, namely a memoetic way of processing. The method is illustrated through a few examples and is compared to other available methods.
منابع مشابه
Resource Logics and Minimalist Grammars
This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are largely informal apart from a few research papers. The study of resource logic, on the other hand, i...
متن کاملCoupling Grammar and Knowledge Base: Range Concatenation Grammars and Description Logics
In this paper we introduce a novel framework to compute jointly syntactic parses and semantic representations of a written sentence. To achieve this goal, we couple a syntactico-semantic grammar and a knowledge base. The knowledge base is implemented in Description Logics, in a polynomial variant. The grammar is a Range Concatenation Grammar, which combines expressive power and polynomial parsi...
متن کاملSome Syntactic Interpretations in Different Systems of Full Lambek Calculus
[8] defines an interpretation of FL without 1 in its version without empty antecedents of sequents (employed in type grammars) and applies this interpretation to prove some general results on the complexity of substructural logics and the generative capacity of type grammars. Here this interpretation is extended for nonassociative logics (also with structural rules), logics with 1, logics with ...
متن کاملCategorial Grammars and Substructural Logics
Substructural logics are formal logics whose Gentzen-style sequent systems abandon some/all structural rules (Weakening, Contraction, Exchange, Associativity). They have extensively been studied in current literature on nonclassical logics from different points of view: as sequent axiomatizations of relevant, multiple-valued and fuzzy logics [73, 44], as so-called resource-sensitive logics for ...
متن کاملTowards a Constraint Parser for Categorial Type Logics
This thesis shows how constraint programming can be applied to the processing of Categorial Type Logics (CTL). It presents a novel formalisation of the parsing task for categorial grammars as a tree configuration problem, and demonstrates how a recent proposal for structural constraints on CTL parse trees [11] can be integrated into this framework. The resulting processing model has been implem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999